Prices stabilization for inexact unit-commitment problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prices stabilization for inexact unit-commitment problems

A widespread and successful approach to tackle unit-commitment problems is constraint decomposition: by dualizing the linking constraints, the large-scale nonconvex problem decomposes into smaller independent subproblems. The dual problem consists then in finding the best Lagrangian multiplier (the optimal“price”); it is solved by a convex nonsmooth optimization method. Realistic modeling of te...

متن کامل

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

متن کامل

Polynomial Time Algorithms and Extended Formulations for Unit Commitment Problems

Recently increasing penetration of renewable energy generation brings challenges for power system operators to perform efficient power generation daily scheduling, due to the intermittent nature of the renewable generation and discrete decisions of each generation unit. Among all aspects to be considered, unit commitment polytope is fundamental and embedded in the models at different stages of ...

متن کامل

A Seeded Memetic Algorithm for Large Unit Commitment Problems

The paper shows that the use of a memetic algorithm (MA), a genetic algorithm (GA) combined with local search, synergistically combined with Lagrangian relaxation is effective and efficient for solving large unit commitment problems in electric power systems. It is shown that standard implementations of GA or MA are not competitive with the traditional methods of dynamic programming (DP) and La...

متن کامل

Single-Unit Commitment Problems in Electricity Pool Markets

We consider an electricity generator with a single generating unit making offers of energy into an electricity pool market. For a given time period, it must submit to the pool system operator a supply function, typically consisting of a fixed number of quantities of energy and prices at which it wants these dispatched. The amount of dispatch depends on the supply function offered along with the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Methods of Operations Research

سال: 2013

ISSN: 1432-2994,1432-5217

DOI: 10.1007/s00186-013-0447-4